A quantitative version of the Kupka-Smale theorem

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On generic properties of lagrangians on surfaces: the Kupka-Smale theorem

In this work, we consider generic properties of lagrangians. Our main result is the Theorem of Kupka-Smale, in the lagrangian setting, claiming that, for a fixed value fixed k ∈ R, generically (in Mañé sense, that is, there exists a residual subset (in C topology) of smooth potentials, O, such that L+f have the desired property, for all f ∈ O), for a convex and superlinear lagrangian defined in...

متن کامل

A More General Version of the Costa Theorem

In accordance with the Costa theorem, the interference which is independent of the channel input and known non-causally at the transmitter, does not affect the capacity of the Gaussian channel. In some applications, the known interference depends on the input and hence has some information. In this paper, we study the channel with input dependent interference and prove a capacity theorem that n...

متن کامل

A quantitative version of the Roth-Ridout theorem

We shall show that there is a effectively computable upper bound of the heights of solutions for an inequality in Roth-Ridout’s theorem.

متن کامل

A Quantitative Version of the Idempotent Theorem in Harmonic Analysis

Suppose that G is a locally compact abelian group, and write M(G) for the algebra of bounded, regular, complex-valued measures under convolution. A measure μ ∈ M(G) is said to be idempotent if μ ∗ μ = μ, or alternatively if μ̂ takes only the values 0 and 1. The Cohen-Helson-Rudin idempotent theorem states that a measure μ is idempotent if and only if the set {γ ∈ Ĝ : μ̂(γ) = 1} belongs to the cos...

متن کامل

A Weak Version of the Blum, Shub, and Smale Model

We propose a weak version of the Blum Shub Smale model of computation over the real numbers. In this weak model only a ``moderate'' usage of multiplications and divisions is allowed. The class of boolean languages recognizable in polynomial time is shown to be the complexity class P poly. The main tool is a result on the existence of small rational points in semi-algebraic sets which is of inde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ergodic Theory and Dynamical Systems

سال: 1985

ISSN: 0143-3857,1469-4417

DOI: 10.1017/s0143385700003072